Search results for "Continued fraction"

showing 10 items of 12 documents

A continued fraction based approach for the Two-photon Quantum Rabi Model

2019

We study the Two Photon Quantum Rabi Model by way of its spectral functions and survival probabilities. This approach allows numerical precision with large truncation numbers, and thus exploration of the spectral collapse. We provide independent checks and calibration of the numerical results by studying an exactly solvable case and comparing the essential qualitative structure of the spectral functions. We stress that the large time limit of the survival probability provides us with an indicator of spectral collapse, and propose a technique for the detection of this signal in the current and upcoming quantum simulations of the model. E.L. acknowledges fruitful discussions with D. Braak. I.…

0301 basic medicineCurrent (mathematics)Two-photon Quantum Rabi modelCalibration (statistics)TruncationStructure (category theory)Collapse (topology)FOS: Physical scienceslcsh:MedicineelectrodynamicsContinued fractionSignalArticleSettore FIS/03 - Fisica Della Materia03 medical and health sciences0302 clinical medicineFraction (mathematics)Statistical physicslcsh:ScienceQuantumPhysicsQuantum PhysicsMultidisciplinaryatomlcsh:RspaceSpectral function030104 developmental biologylcsh:QQuantum Physics (quant-ph)030217 neurology & neurosurgery
researchProduct

Selmer's Multiplicative Algorithm

2011

Abstract.The behavior of the multiplicative acceleration of Selmer's algorithm is widely unknown and no general result on convergence has been detected yet. Solely for its 2-dimensional, periodic expansions, there exist some results on convergence and approximation due to Fritz Schweiger. In this paper we show that periodic expansions of any dimension do in fact converge and that the coordinates of the limit points are rational functions of the largest eigenvalue of the periodicity matrix.

Discrete mathematicsAlgebraSelmerMultiplicative functionPeriodic expansionsMathematicsmultidimensional continued fractions
researchProduct

On Sturmian Graphs

2007

AbstractIn this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conjectures, by Moser and by Zaremba, on the continued fraction expansion of real numbers. These graphs turn out to be the underlying graphs of compact directed acyclic word graphs of central Sturmian words. In order to prove this result, we give a characterization of the maximal repeats of central Sturmian words. We show also that, in analogy with the case of Sturmian words, these graphs converge to infinite ones.

Discrete mathematicsApplied MathematicsCDAWGsContinued fractionsSturmian wordSturmian wordsCharacterization (mathematics)RepeatsDirected acyclic graphCombinatoricsIndifference graphSturmian words CDAWGs Continued fractions RepeatsChordal graphComputer Science::Discrete MathematicsDiscrete Mathematics and CombinatoricsContinued fractionWord (group theory)Computer Science::Formal Languages and Automata TheoryReal numberMathematics
researchProduct

On lazy representations and Sturmian graphs

2011

In this paper we establish a strong relationship between the set of lazy representations and the set of paths in a Sturmian graph associated with a real number α. We prove that for any non-negative integer i the unique path weighted i in the Sturmian graph associated with α represents the lazy representation of i in the Ostrowski numeration system associated with α. Moreover, we provide several properties of the representations of the natural integers in this numeration system.

Discrete mathematicsCombinatoricsOstrowski numerationIntegernumeration systems Sturmian graphs continued fractionsSettore INF/01 - InformaticaGraphMathematicsReal number
researchProduct

Sturmian Graphs and a conjecture of Moser

2004

In this paper we define Sturmian graphs and we prove that all of them have a “counting” property. We show deep connections between this counting property and two conjectures, by Moser and by Zaremba, on the continued fraction expansion of real numbers. These graphs turn out to be the underlying graphs of CDAWGs of central Sturmian words. We show also that, analogously to the case of Sturmian words, these graphs converge to infinite ones.

Discrete mathematicsConjectureProperty (philosophy)Data structuresData structureCombinatoricsPhilosophy of languagecompressed suffixComputer Science::Discrete MathematicsContinued fractionComputer Science::Formal Languages and Automata TheoryAlgorithmsReal numberMathematics
researchProduct

Sturmian graphs and integer representations over numeration systems

2012

AbstractIn this paper we consider a numeration system, originally due to Ostrowski, based on the continued fraction expansion of a real number α. We prove that this system has deep connections with the Sturmian graph associated with α. We provide several properties of the representations of the natural integers in this system. In particular, we prove that the set of lazy representations of the natural integers in this numeration system is regular if and only if the continued fraction expansion of α is eventually periodic. The main result of the paper is that for any number i the unique path weighted i in the Sturmian graph associated with α represents the lazy representation of i in the Ost…

Discrete mathematicsContinued fractionsApplied MathematicsNumeration systemsSturmian graphsGraphCombinatoricsOstrowski numerationIntegerIf and only ifnumeration systems Sturmian graphs continued fractions.Numeration systems; SUBWORD GRAPHS; WORDSDiscrete Mathematics and CombinatoricsSUBWORD GRAPHSContinued fractionWORDSMathematicsReal number
researchProduct

Эмануэль Гринберг - выдающиеся достижения в прикладной математике: радио-фильтры, корпуса танкеров, графы и интегральные схемы Emanuels Grinbergs - i…

2018

The paper is dedicated to the 50th anniversary of the Grinberg theorem. The main works of Emanuel Grinberg (1911-1982) in applied mathematics are described, following the stages of his life path, namely: the design of radio receivers and the calculation of radio filters (1949-1959), hull of tanker calculations (1962-1964), the study of graph theory and the proof of the Grinberg theorem (1968), designing of integrated circuits (1968-1980). Calculations of radio filters are associated with the expansion of the use of continued fractions for the analysis of linear electric circuits (the Kauer model) and the developing of new tools – the Grinberg brackets (as an extension of the Euler brackets)…

Emanuel Grinberg; radio-filter; continued fractions; Cauer model; Euler brackets; Chebyshev polynomials; tanker; theory of splines; graph theory; Grinberg theorem; integrated circuit; Linvill model; the Ebers-Moll model.
researchProduct

Abelian Powers and Repetitions in Sturmian Words

2016

Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79-95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent $k$ for every $k > 0$. We improve on this result by studying the maximum exponents of abelian powers and abelian repetitions (an abelian repetition is an analogue of a fractional power) in Sturmian words. We give a formula for computing the maximum exponent of an abelian power of abelian period $m$ starting at a given position in any Sturmian word of rotation angle $\alpha$. vAs an analogue of the critical exponent, we introduce the abelian critical exponent $A(s_\alpha)$ of a Sturmian word $s_\alpha$ of angle $\alpha$ as the quantity $A(s_\a…

FOS: Computer and information sciencesFibonacci numberGeneral Computer ScienceDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Computer Science - Formal Languages and Automata Theory0102 computer and information sciences01 natural sciencesTheoretical Computer ScienceCombinatoricsFOS: MathematicsMathematics - Combinatorics[INFO]Computer Science [cs]Number Theory (math.NT)0101 mathematicsAbelian groupContinued fractionFibonacci wordComputingMilieux_MISCELLANEOUSQuotientMathematicsMathematics - Number Theoryta111010102 general mathematicsComputer Science (all)Sturmian wordSturmian wordAbelian period; Abelian power; Critical exponent; Lagrange constant; Sturmian word; Theoretical Computer Science; Computer Science (all)Abelian periodLagrange constantCritical exponentAbelian power010201 computation theory & mathematicsBounded functionExponentCombinatorics (math.CO)Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

Linear Response Theory with finite-range interactions

2021

International audience; This review focuses on the calculation of infinite nuclear matter response functions using phenomenological finite-range interactions, equipped or not with tensor terms. These include Gogny and Nakada families, which are commonly used in the literature. Because of the finite-range, the main technical difficulty stems from the exchange terms of the particle–hole interaction. We first present results based on the so-called Landau and Landau-like approximations of the particle–hole interaction. Then, we review two methods which in principle provide numerically exact response functions. The first one is based on a multipolar expansion of both the particle–hole interactio…

Finite-range interactionsNuclear and High Energy PhysicsFinite size instabilities[PHYS.NUCL]Physics [physics]/Nuclear Theory [nucl-th]Nuclear TheoryFormalism (philosophy)Gogny and Nakada interactionsFOS: Physical sciencesContinued fraction approximation01 natural sciencesNuclear Theory (nucl-th)0103 physical sciencesTensorStatistical physics010306 general physicsContinued fractionPhysicsDegree (graph theory)010308 nuclear & particles physicsPropagatorFunction (mathematics)16. Peace & justiceNuclear matterLinear response theoryMultipolar expansionLinear response theory
researchProduct

Strange attractor for the renormalization flow for invariant tori of Hamiltonian systems with two generic frequencies

1999

We analyze the stability of invariant tori for Hamiltonian systems with two degrees of freedom by constructing a transformation that combines Kolmogorov-Arnold-Moser theory and renormalization-group techniques. This transformation is based on the continued fraction expansion of the frequency of the torus. We apply this transformation numerically for arbitrary frequencies that contain bounded entries in the continued fraction expansion. We give a global picture of renormalization flow for the stability of invariant tori, and we show that the properties of critical (and near critical) tori can be obtained by analyzing renormalization dynamics around a single hyperbolic strange attractor. We c…

Mathematical analysisFOS: Physical sciencesTorusInvariant (physics)Nonlinear Sciences - Chaotic DynamicsHamiltonian systemRenormalizationFractalBounded functionAttractorChaotic Dynamics (nlin.CD)Continued fractionMathematics::Symplectic GeometryMathematical physicsMathematicsPhysical Review E
researchProduct